On Noise-Tolerant Learning of Sparse Parities and Related Problems Elena Grigorescu? , Lev Reyzin?? , and Santosh Vempala? ? ? School of Computer Science Georgia Institute of Technology 266 Ferst Drive, Atlanta GA 30332

Source URL: www.levreyzin.com

• Analysis of algorithms
• Computational complexity theory
• Time complexity
• Parity problem
• Parity

Dana Angluin1, James Aspnes1, Jiang Chen2, David Eisenstat, Lev Reyzin1 1Yale University 2Yahoo! Inc. COLT 2008

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Boolean circuit
• NC
• PP
• ACC0
• Circuit
• FO

check_list_letter_v08 [Converted].ai

Source URL: www.dubberly.com

• Statistics
• Neuropsychology
• Artificial intelligence
• Educational psychology
• Neuropsychological assessment
• Problem solving
• Statistical theory
• Computational complexity theory
• Statistical hypothesis testing
• Mathematical optimization

The Computational Power and Complexity of Constraint Handling Rules JON SNEYERS, TOM SCHRIJVERS, and BART DEMOEN K.U.Leuven Constraint Handling Rules (CHR) is a high-level rule-based programming language which is

Source URL: people.cs.kuleuven.be

2nd Summer School in Computational Biology Analyzing high-dimensional data in biology Lecture 1: Introduction to Computational Biology and high-throughput data  Frank Emmert-Streib

Source URL: www.bio-complexity.com

The Computational Complexity of Sensitivity Analysis and Parameter Tuning Johan Kwisthout and Linda C. van der Gaag Department of Information and Computing Sciences, University of Utrecht P.O. Box, 3508 TB Utrecht

Source URL: uai2008.cs.helsinki.fi

Homework III Computational Complexity April 20, 2009 Due by 9:00 pm on Monday, May 4. Submit written solutions to any 4 problems. Collaboration is allowed; please mention your

Source URL: ftp.cs.nyu.edu

arXiv:1401.3604v7 [q-bio.MN] 11 DecMethods of Information Theory and Algorithmic Complexity for Network Biology∗ Hector Zenil†, Narsis A. Kiani and Jesper Tegn´er Unit of Computational Medicine, Department of

Source URL: arxiv.org

The Ackermann Award 2015 Anuj Dawar, Dexter Kozen, and Simona Ronchi Della Rocca Members of the Jury of the EACSL Ackermann Award Abstract The eleventh Ackermann Award is presented at CSL’15 in Berlin, Germany. This ye

Source URL: drops.dagstuhl.de

• Computability theory
• Theory of computation
• Mathematical logic
• EACSL
• Entscheidungsproblem
• Complexity
• Computational complexity theory
• Algorithm
• Decision problem
• Dexter Kozen

Truth vs. Proof in Computational Complexity Boaz Barak∗ September 24, 2012 Theoretical Computer Science is blessed (or cursed?) with many open problems. For some of these questions, such as the P vs N P problem, it see

Source URL: www.boazbarak.org